Rectilinear Bsp Trees for Preferred Ray Sets
نویسندگان
چکیده
Rectilinear Binary Space Partitioning (BSP) trees are often used for solving various types of range searching problems including ray shooting. We propose a novel method for construction of rectilinear BSP trees for a preferred set of ray shooting queries. Particularly, we study ray sets formed by fixing either the direction or the origin of rays. We analyse and discuss the properties of constructed trees. Theoretical considerations are followed by results obtained from the practical implementation.
منابع مشابه
Constructing Rectilinear Bsp Trees for Preferred Ray Sets
We propose a novel method for construction of rectilinear BSP trees for ray shooting acceleration. The trees are contracted according to certain “preferred” set of rays. Particularly, we study ray sets formed by fixing either the direction or the origin of rays. The constructed trees can be used to answer ray shooting query for arbitrary rays, although with higher expected time complexity for r...
متن کاملRay Tracing with Rope Trees
In this paper an acceleration method for finding the nearest ray–object intersection for ray tracing purposes is presented. We use the concept of BSP trees enriched by rope trees. These are used to accelerate the traversal of the BSP tree. We give a comparison of experimental results between the technique based on BSP tree and uniform spatial subdivision.
متن کاملPreferred Direction Steiner Trees
The planar rectilinear Steiner tree problem has been extensively studied. The common formulation ignores circuit fabrication issues such as multiple routing layers, preferred routing directions, and vias between layers. In this paper, the authors extend a previously presented planar rectilinear Steiner tree heuristic to consider layer assignment, preferred routing direction restrictions, and vi...
متن کاملA Fast Algorithm for Computing Optimal Rectilinear Steiner Trees for Extremal Point Sets
We present a fast algorithm to compute an optimal rec-tilinear Steiner tree for extremal point sets. A point set is extremal if each point lies on the boundary of a rectilinear convex hull of the point set. Our algorithm can be used in homotopic routing in VLSI layout design and it runs in O(k 2 n) time, where n is the size of the point set and k is the size of its rectilinear convex hull.
متن کاملLinear BSP Trees for Sets of Hyperrectangles with Low Directional Density
We consider the problem of constructing of binary space partitions (BSP) for a set S of n hyperrectangles in arbitrary dimensional space. If the set S fulfills the low directional density condition defined in this paper then the resultant BSP has O(n) size and it can be constructed in O(n log n) time in R. The low directional density condition defines a new class of objects which we are able to...
متن کامل